package myPow;

public class Solution {
    public double myPow(double x, int n) {
        double res=1;
        for (int i = n; i !=0 ; i/=2) {
            if(i % 2 != 0){ //奇数
                res *= x;
            }
            x *= x;
        }
        return  n < 0 ? 1 / res : res;
    }
}